Imprecise covering ring star problem
نویسندگان
چکیده
In this paper, we formulate and solve an Imprecise Covering Ring Star Problem (ICRSP), which is a generalization of the (RSP). Here objective problem to find subset nodes in network minimize sum routing costs interconnecting cycle assignment are out cycle, their nearest concentrators such that no assigned node exceeds predetermined distance (say, covering distance) from concentrators. The distance, as well assignments costs, considered fuzzy proposed ICRSP. A Modified Genetic Algorithm (MGA) developed used model for different confidence levels depending on corresponding imprecise parameters, reducing it deterministic form with possibility necessity approaches. Some comparisons existing benchmark problems made justify performance algorithm. As individual cases, some practical ICRSPs also solved presented numerically.
منابع مشابه
The Capacitated m-Ring-Star Problem
The Capacitated m-Ring-Star Problem (CmRSP) is the problem of designing a set of rings that pass through a central depot and through some transition points and/or customers, and then assigning each non-visited customer to a visited point or customer. The number of customers visited and assigned to a ring is bounded by an upper limit: the capacity of the ring. The objective is to minimize the to...
متن کاملAn exact algorithm for solving the ring star problem
This paper deals with the ring star problem that consists in designing a ring that pass through a central depot, and then assigning each non visited customer to a node of the ring. The objective is to minimize the total routing and assignment costs. A new chain based formulation is proposed. Valid inequalities are proposed to strengthen the linear programming relaxation and are used as cutting ...
متن کاملThe Ring Star Problem: Polyhedral analysis and exact algorithm
In the Ring Star Problem, the aim is to locate a simple cycle through a subset of vertices of a graph with the objective of minimizing the sum of two costs: a ring cost proportional to the length of the cycle and an assignment cost from the vertices not in the cycle to their closest vertex on the cycle. The problem has several applications in telecommunications network design and in rapid trans...
متن کاملA heuristic procedure for the Capacitated m-Ring-Star problem
In this paper we propose a heuristic method to solve the Capacitated m-Ring-Star Problem which has many practical applications in communication networks. The problem consists of finding m rings (simple cycles) visiting a central depot, a subset of customers and a subset of potential (Steiner) nodes, while customers not belonging to any ring must be “allocated” to a visited (customer or Steiner)...
متن کاملMetaheuristics for the Bi-objective Ring Star Problem
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, related to the length of the cycle, whereas the second one is to minimize an assignment cost, from non-visited nodes to visited ones. In spite of its natural multi-objective formulation, this problem has never been inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Decision Making
سال: 2023
ISSN: ['2560-6018', '2620-0104']
DOI: https://doi.org/10.31181/dmame0323062022s